Enhancing the Performance of Conjugate Gradient Solvers on Graphic Processing Units
نویسندگان
چکیده
منابع مشابه
The Application of Projected Conjugate Gradient Solvers on Graphical Processing Units
Graphical processing units introduce the capability for large scale computation in the desk top environment. For the solution of linear systems of equations, much effort has been devoted to efficient implementation of Krylov subspace-based solvers in high performance computing environments. Here the focus is to improve the computational efficiency of the projected conjugate gradient algorithm. ...
متن کاملPerformance of Parallel Conjugate Gradient Solvers in Meshfree Analysis
Meshfree analysis methods, on a per degree of freedom basis, are typically more computationally expensive and yet more accurate than finite element methods. For very large models, whether meshfree or finite element, the memory and computational effort associated with direct equation solvers makes them prohibitively expensive. In this work, the performance of different linear equation solvers wi...
متن کاملCellular Genetic Algorithm on Graphic Processing Units
The availability of low cost powerful parallel graphic cards has estimulated a trend to implement diverse algorithms on Graphic Processing Units (GPUs). In this paper we describe the design of a parallel Cellular Genetic Algorithm (cGA) on a GPU and then evaluate its performance. Beyond the existing works on masterslave for fitness evaluation, we here implement a cGA exploiting data and instruc...
متن کاملConjugate Gradients on Graphic Hardware: Performance & Feasibility
The Conjugate Gradient method (CG), one of the most commonly used iterative methods for solving very large systems of equations, has a history of running at less than 10% of peak processor performance, because its memory bounded nature and irregular access patterns. Due to their low cost and very large bandwidth, one solution that becomes more and more attractive is using GPUs as accelerators. ...
متن کاملConjugate gradient solvers on Intel Xeon Phi and NVIDIA GPUs
Lattice Quantum Chromodynamics simulations typically spend most of the runtime in inversions of the Fermion Matrix. This part is therefore frequently optimized for various HPC architectures. Here we compare the performance of the Intel R Xeon Phi TM to current Kepler-based NVIDIA R Tesla TM GPUs running a conjugate gradient solver. By exposing more parallelism to the accelerator through inverti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Magnetics
سال: 2011
ISSN: 0018-9464,1941-0069
DOI: 10.1109/tmag.2010.2081662